Boolean Normal Forms, Shellability, and Reliability Computations
نویسندگان
چکیده
منابع مشابه
Boolean Normal Forms, Shellability, and Reliability Computations
Orthogonal forms of positive Boolean functions play an important role in reliability theory, since the probability that they take value 1 can be easily computed. However, few classes of disjunctive normal forms are known for which orthogonalization can be efficiently performed. An interesting class with this property is the class of shellable disjunctive normal forms (DNFs). In this paper, we p...
متن کاملNetwork-driven Boolean Normal Forms
We apply the PolyBoRi framework for Gröbner bases computations with Boolean polynomials to bit-valued problems from algebraic cryptanalysis and formal verification. First, we proposed zero-suppressed binary decision diagrams (ZDDs) as a suitable data structure for Boolean polynomials. Utilizing the advantages of ZDDs we develop new reduced normal form algorithms for linear lexicographical lead ...
متن کاملComposition of Post classes and normal forms of Boolean functions
The class composition C ◦ K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f ∈ C, g1, . . . , gn ∈ K, is investigated. This composition C ◦K is either the join C ∨K in the Post Lattice or it is not a clone, and all pairs of clones C,K are classified accordingly. Factorizations of the clone Ω of all Boolean functions as a composition of minimal clones are describe...
متن کاملConjunctive Normal Forms with Non-boolean Variables, Autarkies and Hypergraph Colouring Conjunctive Normal Forms with Non-boolean Variables, Autarkies and Hypergraph Colouring
We investigate in depth the properties of a natural generalisation, called “sets of no-goods” in the AI literature, of boolean formulas in conjunctive normal forms such that non-boolean variables can be used. After building up a solid foundation, we generalise the notion of deficiency, and we obtain polynomial time satisfiability decision for generalised clause-sets with fixed maximal deficienc...
متن کاملNormal Forms and
In this paper we present a framework for the combination of modal and temporal logic. This framework allows us to combine diier-ent normal forms, in particular, a separated normal form for temporal logic and a rst-order clausal form for modal logics. The calculus of the framework consists of temporal resolution rules and standard rst-order resolution rules. We show that the calculus provides a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2000
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s089548019732180x